Hierarchical Knowledge for Heuristic Problem Solving — A Case Study on the Traveling Salesperson Problem
نویسندگان
چکیده
Abstraction is a fundamental feature of human-level intelligence. But it is not clear how to combine knowledge on different levels of abstraction. This paper examines the use of hierarchical knowledge for heuristic problem-solving algorithms, regarding three options for integrating hierarchical knowledge into heuristic search: as a state evaluation heuristic, as a search-guiding heuristic and as a hierarchical search strategy. The Traveling Salesperson Problem serves as an example of a problem-solving task and the different strategies are evaluated with respect to tour length, robustness against misleading hierarchy assignments and acceptability of results by humans. It turns out that the most effective and stable results can be achieved with hierarchical knowledge as a searchguiding heuristic combined with other heuristics.ion is a fundamental feature of human-level intelligence. But it is not clear how to combine knowledge on different levels of abstraction. This paper examines the use of hierarchical knowledge for heuristic problem-solving algorithms, regarding three options for integrating hierarchical knowledge into heuristic search: as a state evaluation heuristic, as a search-guiding heuristic and as a hierarchical search strategy. The Traveling Salesperson Problem serves as an example of a problem-solving task and the different strategies are evaluated with respect to tour length, robustness against misleading hierarchy assignments and acceptability of results by humans. It turns out that the most effective and stable results can be achieved with hierarchical knowledge as a searchguiding heuristic combined with other heuristics.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملA Bi-Level Meta-heuristic Approach for a Hazardous Waste Management Problem
This study concentrates on designing a medical waste management system with a hierarchical structure, including a local government and a waste management planner. The upper-level seeks to design and control the waste management facilities by minimizing the environmental risks related to the disposal of medical waste. While the lower-level model is to determine the waste collection plans by only...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کامل